Hamiltonian Cycles on Random Eulerian Triangulations

نویسنده

  • E. Guitter
چکیده

A random Eulerian triangulation is a random triangulation where an even number of triangles meet at any given vertex. We argue that the central charge increases by one if the fully packed O(n) model is defined on a random Eulerian triangulation instead of an ordinary random triangulation. Considering the case n → 0, this implies that the system of random Eulerian triangulations equipped with Hamiltonian cycles describes a c = −1 matter field coupled to 2D quantum gravity as opposed to the system of usual random triangulations equipped with Hamiltonian cycles which has c = −2. Hence, in this case one should see a change in the entropy exponent from the value γ = −1 to the irrational value γ = −1− √ 13 6 = −0.76759... when going from a usual random triangulation to an Eulerian one. A direct enumeration of configurations confirms this change in γ. PACS codes: 05.20.y, 04.60.Nc, 02.10.Eb

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Diagonal Flips in Hamiltonian Triangulations on the Sphere

In this paper, we shall prove that any two Hamiltonian triangulations on the sphere with n 5 vertices can be transformed into each other by at most 4n 20 diagonal flips, preserving the existence of Hamilton cycles. Moreover, using this result, we shall prove that at most 6n 30 diagonal flips are needed for any two triangulations on the sphere with n vertices to transform into each other.

متن کامل

On the Strongest Form of a Theorem of Whitney for Hamiltonian Cycles in Plane Triangulations

Tuesday, September 2 12:30–1:20 4119 Harris Hall The question whether for a given graph a hamiltonian cycle exists is NPcomplete, even when restricted to the class of plane triangulations. However, in 1931 Whitney proved a sufficient condition: each plane triangulation containing no non-facial cycle of length 3 is hamiltonian. More than 70 years later, Jackson and Yu succeeded in finding a cons...

متن کامل

Diagonal flips in Hamiltonian triangulations on the projective plane

In this paper, we shall prove that any two triangulations on the projective plane with n vertices can be transformed into each other by at most 8n− 26 diagonal flips, up to isotopy. To prove it, we focus on triangulations on the projective plane with contractible Hamilton cycles. © 2005 Elsevier B.V. All rights reserved.

متن کامل

On the number of hamiltonian cycles in triangulations with few separating triangles

In 1979 Hakimi, Schmeichel and Thomassen proved that in a triangulation with n vertices and no “separating triangles” – that is: no cycle of length 3 such that there are vertices inside as well as outside of the cycle – there are at least n/(log2 n) different hamiltonian cycles. We introduce a new abstract counting technique for hamiltonian cycles in general graphs. This technique is based on a...

متن کامل

Hamiltonicity of digraphs for universal cycles of permutations

The digraphs P (n, k) have vertices corresponding to length k permutations of an n set and arcs corresponding to (k + 1) permutations. Answering a question of Starling, Klerlein, Kier and Carr we show that these digraphs are Hamiltonian for k ≤ n − 3. We do this using restricted Eulerian cycles and the fact that P (n, k) is nearly the line digraph of P (n, k−1). We also show that the digraphs P...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998